On Curved Simplicial Elements and Best Quadratic Spline Approximation for Hierarchical Data Representation
نویسنده
چکیده
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over twoor three-dimensional domains typically contain boundaries and discontinuities that are to be preserved and approximated well for data analysis and visualization. Curved simplicial elements make possible a better representation of curved geometry, domain boundaries, and discontinuities than simplicial elements with non-curved edges and faces. We use quadratic basis functions and compute best quadratic simplicial spline approximations that are C0-continuous everywhere except where field discontinuities occur whose locations we assume to be given. We adaptively refine a simplicial approximation by identifying and bisecting simplicial elements with largest errors. It is possible to store multiple approximation levels of increasing quality. Our method can be used for hierarchical data processing and visualization. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
منابع مشابه
Best Quadratic Spline Approximation
We present a method for hierarchical data approximation using quadratic simplicial elements for domain decomposition and field approximation. Higher-order simplicial elements can approximate data better than linear elements. Thus, fewer quadratic elements are required to achieve similar approximation quality. We use quadratic basis functions and compute best quadratic simplicial spline approxim...
متن کاملUsing quadratic simplicial elements for hierarchical approximation and visualization
Best quadratic simplicial spline approximations can be computed, using quadratic Bernstein-Bézier basis functions, by identifying and bisecting simplicial elements with largest errors. Our method begins with an initial triangulation of the domain; a best quadratic spline approximation is computed; errors are computed for all simplices; and simplices of maximal error are subdivided. This process...
متن کاملHIGAMod: A Hierarchical IsoGeometric Approach for MODel reduction in curved pipes
In computational hemodynamics we typically need to solve incompressible fluids in domains given by curved pipes or network of pipes. To reduce the computational costs, or conversely to improve models based on a pure 1D (axial) modeling, an approach called “Hierarchical Model reduction” (HiMod) was recently proposed. It consists of a diverse numerical approximation of the axial and of the transv...
متن کاملUncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space
Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...
متن کاملMulti-resolution Surface Approximation for Animation
This paper considers the problem of approximating a digitized surface in R3 with a hierarchical bicubic B-spline to produce a manipulatable surface for further modelling or animation. The 3D data's original mapping from R2 (multiple rows of cylindrical scans) is mapped into the parametric domain of the B-spline (also in R2) using a modified chord-length parameterization. This mapping is used to...
متن کامل